Granular computing for relational data classification
نویسندگان
چکیده
منابع مشابه
INTERVAL ANALYSIS-BASED HYPERBOX GRANULAR COMPUTING CLASSIFICATION ALGORITHMS
Representation of a granule, relation and operation between two granules are mainly researched in granular computing. Hyperbox granular computing classification algorithms (HBGrC) are proposed based on interval analysis. Firstly, a granule is represented as the hyperbox which is the Cartesian product of $N$ intervals for classification in the $N$-dimensional space. Secondly, the relation betwee...
متن کاملGranular computing for data mining
Granular computing, as an emerging research field, provides a conceptual framework for studying many issues in data mining. This paper examines some of those issues, including data and knowledge representation and processing. It is demonstrated that one of the fundamental tasks of data mining is searching for the right level of granularity in data and knowledge representation.
متن کاملBottle Up Granular Computing Classification Algorithms
Shape of granule is one of the important issues in granular computing classification problems and related to the classification accuracy, the number of granule, and the join process of two granules. A bottle up granular computing classification algorithm (BUGrC) is developed in the frame work of fuzzy lattices. Firstly, the granules are represented as 4 shapes, namely hyperdiamond granule, hype...
متن کاملInduction of Classification Rules by Granular Computing
A granular computing model is used for learning classification rules by considering the two basic issues: concept formation and concept relationships identification. A classification rule induction method is proposed. Instead of focusing on the selection of a suitable partition, i.e., a family of granules defined by values of an attribute, in each step, we concentrate on the selection of a sing...
متن کاملGranular Computing as a Basis for Consistent Classification Problems
Within a granular computing model of data mining, we reformulate the consistent classification problems. The granulation structures are partitions of a universe. A solution to a consistent classification problem is a definable partition. Such a solution can be obtained by searching a particular partition lattice. The new formulation enables us to precisely and concisely define many notions, and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Intelligent Information Systems
سال: 2013
ISSN: 0925-9902,1573-7675
DOI: 10.1007/s10844-013-0241-z